Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications
نویسندگان
چکیده
Many problems reduce to the fixed-point problem of solving x = T (x), where T is a mapping from a Hilbert space to itself. To this problem, we apply the coordinate-update algorithms, which update only one or a few components of x at each step. When each step is cheap, these algorithms are faster than the full fixed-point iteration (which updates all the components). In this paper, we focus on cyclic coordinate selection rules, where the ordering of coordinates in each cycle is arbitrary. The corresponding algorithms are fast, but their convergence is unknown in the fixed-point setting. When T is a nonexpansive operator and has a fixed point, we show that the sequence of coordinate-update iterates converges to a fixed point under proper step sizes. This result applies to the primal-dual coordinate-update algorithms, which have wide applications to optimization problems with nonseparable nonsmooth objectives, as well as global linear constraints. Numerically, we apply coordinate-update algorithms with cyclic, shuffled cyclic, and random selection rules to `1 robust least squares, total variation minimization, as well as nonnegative matrix factorization. They converge much faster than the standard fixed-point iteration. Among the three rules, cyclic and shuffled cyclic rules are overall faster than the random rule.
منابع مشابه
Coordinate Friendly Structures, Algorithms and Applications
This paper focuses on the coordinate update method, which is useful for solving large-sized problems involving linear and nonlinear mappings, and smooth and nonsmooth functions. It decomposes a problem into simple subproblems, where each subproblem updates one, or a small block of, variables. The coordinate update method sits at a high level of abstraction and includes many special cases such a...
متن کاملEquilibrium problems and fixed point problems for nonspreading-type mappings in hilbert space
In this paper by using the idea of mean convergence, weintroduce an iterative scheme for finding a common element of theset of solutions of an equilibrium problem and the fixed points setof a nonspreading-type mappings in Hilbert space. A strongconvergence theorem of the proposed iterative scheme is establishedunder some control conditions. The main result of this paper extendthe results obtain...
متن کاملIterative algorithms for families of variational inequalities fixed points and equilibrium problems
متن کامل
Strong convergence of modified iterative algorithm for family of asymptotically nonexpansive mappings
In this paper we introduce new modified implicit and explicit algorithms and prove strong convergence of the two algorithms to a common fixed point of a family of uniformly asymptotically regular asymptotically nonexpansive mappings in a real reflexive Banach space with a uniformly G$hat{a}$teaux differentiable norm. Our result is applicable in $L_{p}(ell_{p})$ spaces, $1 < p
متن کاملOn Unbounded Delays in Asynchronous Parallel Fixed-Point Algorithms
The need for scalable numerical solutions has motivated the development of asynchronous parallel algorithms, where a set of nodes run in parallel with little or no synchronization, thus computing with delayed information. This paper studies the convergence of the asynchronous parallel algorithm ARock under potentially unbounded delays. ARock is a general asynchronous algorithm that has many app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 39 شماره
صفحات -
تاریخ انتشار 2017